Parallel Opposite Sides Polygons
نویسنده
چکیده
In this paper we consider planar polygons with parallel opposite sides. This type of polygons can be regarded as discretizations of closed convex planar curves by taking tangent lines at samples with pairwise parallel tangents. For this class of polygons, we define discrete versions of the area evolute, central symmetry set, equidistants and area parallels and show that they behave quite similarly to their smooth counterparts. Mathematics Subject Classification (2010). 53A15.
منابع مشابه
Solids Whose Parallel Cross-Sections are Regular Polygons
Given a solid in R3 whose base is contained in the xy-plane and parallel cross-sections perpendicular to the xy-plane are regular polygons, the volume and surface area are determined. Additionally, the asymptotic behavior of the solid as the number of sides of the crosssectional polygon increases is analyzed.
متن کاملOptimal Nearly-Similar Polygon Stabbers of Convex Polygons
A convex polygon that is nearly-similar to a model polygon P has sides parallel and in the same order to the corresponding sides of P. The lengths of the sides are unrestricted and may be zero. Given a set of target convex polygons in the plane with a total of n vertices, and a xed model convex stabbing polygon P, the minimum-perimeter polygon nearly-similar to P that stabs the targets can be f...
متن کاملNeurons' Short-Term Plasticity Amplifies Signals
Subjects Twelve healthy, native British-speaking volunteers (11M, 1F) participated in this study. Ages ranged from 18 to 65 years (mean = 44), and all were right handed according to self report. All were medically screened so anyone with a history of neurological or psychiatric disorder could be avoided. Participants were then briefed on scanner safety and gave written consent before taking par...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملOn the Relative Lengths of Sides of Convex Polygons
Let C be a convex body. By the relative distance of points p and q we mean the ratio of the Euclidean distance of p and q to the half of the Euclidean length of a longest chord of C parallel to pq. The aim of the paper is to find upper bounds for the minimum of the relative lengths of the sides of convex hexagons and
متن کامل